Document ranking on weight-partitioned signature files
نویسندگان
چکیده
منابع مشابه
Fast Search Algorithms for Weight-partitioned Signature Files
This paper is a continuation of work started in 7]. We try two approaches to improve the response time of weight-partitioned signature les. In the rst approach, we propose several fast heuristic search algorithms to reduce the percentage of signatures that needs to be searched. On average they achieve search reduction ratios in the range of 40% to 65% without sacriicing any precision and recall...
متن کاملPerformance Analysis of Key-partitioned Signature Files
Key-partitioned signature les is a very eeective technique to facilitate fast signature le search. It usually reduce the number of signatures searched to a fraction of the total signature les. In this paper, we propose a new key-based partitioning method, variable-preex partitioning, to improve the work done by Lee and Leng 8, 9]. we also present some analytically study of key-partitioned signa...
متن کاملRanking the Validity of Block Candidacies in Signature Files
A variation of the superimposed coding version of the signature file method is introduced. The processing of a user query is similar to that of the conventional method with one difference: the output is provided in a ordered (ranked) way. The latter is based on a credibility value reflecting the probability of each candidate block to pass the validation test rather than being a false drop. The ...
متن کاملSignature files and signature trees
The signature file method is a popular indexing technique used in information retrieval and databases. It excels in efficient index maintenance and lower space overhead. However, it suffers from inefficiency in query processing due to the fact that for each query processed the entire signature file needs to be scanned. In this paper, we introduce a tree structure, called a signature tree, estab...
متن کاملA Partitioned Signature File
Signature le has been shown to be a very good access method for text and multiattribute retrieval 6,13]. It has a low storage overhead and a simple structure. However its speed is poor compared to an inverted le, since every signature in the le must be searched. In this paper, we introduce a partitioning method to reduce the search space required on the signature le. A partitioned signature le ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Information Systems
سال: 1996
ISSN: 1046-8188,1558-2868
DOI: 10.1145/226163.226164